Unary Automatic Graphs: An Algorithmic Perspective
نویسندگان
چکیده
. In Proc. TAMC’08, to appear. Khoussainov, B. and Nerode, A. (1995) Automatic presentation of structures. LNCS 960, 367– 392. Springer-Verlag. Khoussainov, B., Nies, A., Rubin, S. and Stephan, F. (2004) Automatic structures: richness and limitations. In Proc. 19th LICS, 44–53. Khoussainov, B. and Rubin, S. (2001) Graphs with automatic presentations over a unary alphabet. Journal of Automata, Languages and Combinatorics 6 (4), 467–480. Khoussainov, B., Rubin, S. and Stephan, F, (2005) Automatic linear orders and trees. ACM Trans. Comput. Log. 6 (4), 675–700. Libkin, L. (2004) Elements of finite model theory. Springer-Verlag. Lohrey, M. (2003) Automatic structures of bounded degree. In Proc. 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), LNAI 2850,
منابع مشابه
Unary Automatic Graphs: Algorithmic Perspective
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by finite automata over unary alphabet). We investigate algorithmic properties of such unfolded graphs given their finite presentations. In particular, we ask whethe...
متن کاملAnalyzing Complexity in Classes of Automatic Structures
This paper addresses the complexity of several families of queries in classes of unary automatic structures. The queries include membership and isomorphism. In addition, we study the state complexity of describing these classes. In particular, we focus on automatic equivalence relations, linear orders, trees, and graphs with finite degree. A unary automatic structure is one that can be describe...
متن کاملAnalysing Complexity in Classes of Automatic Structures
This paper addresses the complexity of several families of queries (including membership and isomorphism) in classes of unary automatic structures, and the state complexity of describing these classes. We focus on automatic equivalence relations, linear orders, trees, and graphs with finite degree. A unary automatic structure is one that can be described by finite automata over the unary alphab...
متن کاملUnary FA-Presentable Semigroups
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of interesting decision problems. A particular focus of research has been the classification of those structures of some species that admit automatic presentations. Whilst some successes have been obtained, this appears to be a difficult pro...
متن کاملDeciding the isomorphism problem in classes of unary automatic structures
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic equivalence relations, unary automatic linear orders, and unary automatic trees. That is, we provide algorithms which decide whether two given elements of these classes are isomorphic. In doing so, we define new finite representations for these structures which give normal forms. 1
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008